Convergence acceleration method of large-scale parallel iterative solvers for heterogeneous properties
نویسنده
چکیده
In large-scale scienti c computing, linear sparse solver is one of the most time-consuming process. In GeoFEM, various types of preconditioned iterative method is implemented on massively parallel computers. It has been well-known that ILU(0) factorization is very e ective preconditioning method for iterative solver. But it's also well-known that this method requires global data dependency and this is not the optimal way on parallel computers where locality is of utmost importance. In this paper, "Localized" ILU(0) preconditioning method has been implemented to various type of iterative solvers. This method provides data locality on each processor and good parallelization e ect. Developed system performance has been also evaluated on workstation cluster with MPI. Linear Solvers In GeoFEM In GeoFEM, preconditioned iterative method is implemented on massively parallel computers in order to solve large scale problems with more than 10 DOFs. GeoFEM solves both of symmetric and un-symmetric matrices. Therefore CG (Conjugate Gradient) for symmetric matrices and BiCGSTAB (Bi-Conjugate Gradient Stabilized) and GMRES (Generalized Minimal Residual) methods are implemented. GMRES is especially suitable for nonlinear problems. Message passing type programming model is adopted and the program is written in Fortran 90 with MPI [1]. Whole region is partitioned by node-based manner. Local operation is considered to be very important in order to handle large data easily and to attain good parallelization e ect. Local data structure with communication table described in [2] is implemented. Thus data handling and matrix assemble operations are fully localized and global operation occurs only in the solver subsystem (Fig.1). Actually, no global information except partition to partition connectivity is required. In iterative solvers, preconditioning is very important for convergence. In this paper strong and stable preconditioning method for parallel computing is developed and discussed.
منابع مشابه
On some Aitken-like acceleration of the Schwarz method
In this paper we present a family of domain decomposition based on Aitken-like acceleration of the Schwarz method seen as an iterative procedure with a linear rate of convergence. We rst present the so-called Aitken–Schwarz procedure for linear di erential operators. The solver can be a direct solver when applied to the Helmholtz problem with ve-point nite di erence scheme on regular grids. We ...
متن کاملParallel Iterative Solvers with the Selective Blocking Preconditioning for Simulations of Fault-Zone Contact
Iterative solver with preconditioning is the most powerful choice for large-scale scientific computation, especially for the parallel computing. In nonlinear problems such as contact simulations for geophysics, the condition numbers of the coefficient matrices are usually large due to special constraint conditions. The result is slow convergence of the iterative solver. In this study, a new pre...
متن کاملAcceleration of Preconditioned Krylov Solvers for Bubbly Flow Problems
We consider the linear system arising from discretization of the pressure Poisson equation with Neumann boundary conditions, derived from bubbly flow problems. In the literature, preconditioned Krylov iterative solvers are proposed, but they often suffer from slow convergence for relatively large and complex problems. We extend these traditional solvers with the so-called deflation technique, t...
متن کاملDevelopment of Krylov and AMG Linear Solvers for Large-Scale Sparse Matrices on GPUs
This research introduce our work on developing Krylov subspace and AMG solvers on NVIDIA GPUs. As SpMV is a crucial part for these iterative methods, SpMV algorithms for single GPU and multiple GPUs are implemented. A HEC matrix format and a communication mechanism are established. And also, a set of specific algorithms for solving preconditioned systems in parallel environments are designed, i...
متن کاملParallel iterative solvers with selective blocking preconditioning for simulations of fault-zone contact
Iterative solvers with preconditioning are the most powerful choice for large-scale scientific computation, especially for parallel computing. In nonlinear problems such as contact simulations for geophysics, the condition numbers of the coefficient matrices are usually large due to special constraint conditions. The result is slow convergence of the iterative solver. In this study, a new pre-c...
متن کامل